Computational methods for difference families in finite abelian groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo-Free Families of Finite Computational Elementary Abelian p-Groups

We initiate the study of (weakly) pseudo-free families of computational elementary abelian pgroups, where p is an arbitrary fixed prime. We restrict ourselves to families of computational elementary abelian p-groups Gd such that for every index d, each element of Gd is represented by a single bit string of length polynomial in the length of d. First, we prove that pseudo-freeness and weak pseud...

متن کامل

On some computational problems in finite abelian groups

We present new algorithms for computing orders of elements, discrete logarithms, and structures of finite abelian groups. We estimate the computational complexity and storage requirements, and we explicitly determine the O-constants and Ω-constants. We implemented the algorithms for class groups of imaginary quadratic orders and present a selection of our experimental results. Our algorithms ar...

متن کامل

Decomposing finite Abelian groups

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

متن کامل

Factoring finite abelian groups

It is shown that if in the factorization of a finite cyclic group each factor has either prime power order or order equal to the product of two primes then one factor must be periodic. This is shown to be the best possible result of this type.  2004 Elsevier Inc. All rights reserved.

متن کامل

non-divisibility for abelian groups

Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting   all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Special Matrices

سال: 2019

ISSN: 2300-7451

DOI: 10.1515/spma-2019-0012